Decomposition of Congruence Modular Algebras into Atomic, Atomless Locally Uniform and Anti-Uniform Parts

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence Lattices of Uniform Lattices

A lattice L is uniform, if for any congruence Θ of L, any two congruence classes A and B of Θ are of the same size, that is, |A| = |B| holds. A classical result of R. P. Dilworth represents a finite distributive lattice D as the congruence lattice of a finite lattice L. We show that this L can be constructed as a finite uniform lattice.

متن کامل

M-IDEAL STRUCTURE IN UNIFORM ALGEBRAS

It is proved that if A is aregular uniform algebra on a compact Hausdorff space X in which every closed ideal is an M-ideal, then A = C(X).

متن کامل

Non-uniform Sampling Pattern Recognition Based on Atomic Decomposition

Non-uniform sampling is an interesting scheme that can outperforms the uniform sampling with low activity signals. With such signals, it generates fewer samples, which means less data to process and lower power consumption. In addition, it is well-known that asynchronous logic is a low power technology. This paper deals with the coupling between a non-uniform sampling scheme and a pattern recog...

متن کامل

Uniform Algebras on Curves

The proofs use the notion of analytic structure in a maximal ideal space. J. Wermer first obtained results along these lines and further contributions were made by E. Bishop and H. Royden and then by G. Stolzenberg [5] who proved STOLZENBERG'S THEOREM. Let XQC be a polynomially convex set. Let KQC be a finite union of Q-curves. Then (XKJK)*—X\JK is a {possibly empty) pure 1-dimensional analytic...

متن کامل

Locally Uniform Comparison Image Descriptor

Keypoint matching between pairs of images using popular descriptors like SIFT or a faster variant called SURF is at the heart of many computer vision algorithms including recognition, mosaicing, and structure from motion. However, SIFT and SURF do not perform well for real-time or mobile applications. As an alternative very fast binary descriptors like BRIEF and related methods use pairwise com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Section of Logic

سال: 2016

ISSN: 2449-836X,0138-0680

DOI: 10.18778/0138-0680.45.3.4.05